On set-theoretically independent collections of balls
نویسندگان
چکیده
منابع مشابه
On Intersecting a Point Set with Euclidean Balls
The growth function for a class of subsets C of a set X is defined by m’(N) = max {AC(F): F G X, IFI = N} , N = 1,2,. . . , where AC(F) = ({F n C: C E C}l, the number of possible sets obtained by intersecting an element of C with the set F. Sauer (1972) showed that if C forms a Vapnik-Chervonenkis class with dimension V(C), then V(C)-1 mC(N) < c 7 0 for N > V(C) 1. j=o The collection C of Eucli...
متن کاملSet-Consensus Collections are Decidable
A natural way to measure the power of a distributed-computing model is to characterize the set of tasks that can be solved in it. In general, however, the question of whether a given task can be solved in a given model of computation is undecidable, even if we only consider the wait-free shared-memory model. In this paper, we address this question for a restricted class of models and tasks. We ...
متن کاملOn Konig-Egervary Collections of Maximum Critical Independent Sets
Abstract Let G be a simple graph with vertex set V (G). A set S ⊆ V (G) is independent if no two vertices from S are adjacent. The graph G is known to be a KönigEgerváry if α (G) + μ (G) = |V (G)|, where α (G) denotes the size of a maximum independent set and μ (G) is the cardinality of a maximum matching. The number d (X) = |X| − |N(X)| is the difference of X ⊆ V (G), and a set A ∈ Ind(G) is c...
متن کاملInformation Theoretically Secure Multi Party Set Intersection Re-visited
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem with n parties, that provides information theoretic security, when t < n 3 parties are corrupted by an active adversary having unbounded computing power. In [16], the authors claimed that their protocol takes six roun...
متن کاملOn Independent Set on B1-EPG Graphs
In this paper we consider the Maximum Independent Set problem (MIS) on B1-EPG graphs. EPG (for Edge intersection graphs of Paths on a Grid) was introduced in [9] as the class of graphs whose vertices can be represented as simple paths on a rectangular grid so that two vertices are adjacent if and only if the corresponding paths share at least one edge of the underlying grid. The restricted clas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1964
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-13-2-223-233